Interactive Orthogonal Graph Drawing

Sketch-Driven Orthogonal Graph Drawing

We present an orthogonal graph drawing algorithm that uses a sketchy drawing of the graph as input. While the algorithm produces an orthogonal drawing with few bends in the Kandinsky model it also preserves the general appearance of the sketch. Potential applications for this kind of drawing algorithm include the generation of schematic maps from geographic networks and interactive orthogonal g...

Issues in Interactive Orthogonal Graph Drawing (preliminary Version)

Several applications require human interaction during the design process. The user is given the ability to alter the graph as the design progresses. Interactive Graph Drawing gives the user the ability to dynamically interact with the drawing. In this paper we discuss features that are essential for an interactive drawing system. We also describe some possible interactive drawing scenaria and p...

The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing

In this paper, we study orthogonal graph drawings from a practical point of view. Most previously existing algorithms restricted the attention to graphs of maximum degree four. Here we study orthogonal drawing algorithms that work for any input graph, and discuss diierent models for such drawings. Then we introduce the three-phase method, a generic technique to create high-degree orthogonal dra...

Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions

We present two algorithms for orthogonal graph drawing in three dimensional space. For a graph with n vertices of maximum degree six, the 3-D drawing is produced in linear time, has volume at most 4.63n and has at most three bends per edge. If the degree of the graph is arbitrary, the vertices are represented by solid 3-D boxes whose surface is proportional to their degree. The produced drawing...

Fully Dynamic Orthogonal Graph Layout for Interactive Systems